Calculus of Embeddings
نویسنده
چکیده
Let M and N be smooth manifolds, where M ⊂ N and dim(N)− dim(M) ≥ 3. A disjunction lemma for embeddings proved recently by Goodwillie leads to a calculation up to extension problems of the base point component of the space of smooth embeddings of M in N . This is mostly in terms of imm(M,N), the space of smooth immersions, which is well understood, and embedding spaces emb(S,N) for finite subsets S of M with few elements. The meaning of few depends on the precision desired. 0. Introduction: Immersions vs. embeddings Let M and N be smooth manifolds without boundary. Suppose that m ≤ n, and ifm = n, suppose also thatM has no compact component. Let mono(TM, TN) be the space of vector bundle monomorphisms TM → TN . Such a vector bundle monomorphism consists of a continuous map f : M → N and, for each x ∈ M , a linear monomorphism TxM → Tf(x)N which depends continuously on x. For example, an immersion f : M → N has a differential df : TM → TN which belongs to mono(TM, TN). In this way, (*) imm(M,N) ⊂mono(TM, TN) where imm(M,N) is the space of smooth immersions from M to N . The main theorem of immersion theory states that the inclusion (*) is a homotopy equivalence. The clearest references for this are perhaps [HaePo], for the PL analog, and [Hae1], but the theorem goes back to Smale [Sm] and Hirsch [Hi]. Smale’s stunning discovery that the immersions S → R given by x 7→ x and x 7→ −x respectively are regularly homotopic (homotopic through immersions) is a direct consequence of the main theorem. There is reformulation of the theorem which can only be decoded with a little homotopy theory. It goes like this. The rule V 7→ imm(V,N) is a contravariant functor (cofunctor for short) from the poset O of open subsets V ⊂M to spaces. That 1991 Mathematics Subject Classification. Primary 57R40, 57R42.
منابع مشابه
Formalizing Homogeneous Language Embeddings
The cost of implementing syntactically distinct Domain Specific Languages (DSLs) can be reduced by homogeneously embedding them in a host language in cooperation with its compiler. Current homogeneous embedding approaches either restrict the embedding of multiple DSLs in order to provide safety guarantees, or allow multiple DSLs to be embedded but force the user to deal with the interoperabilit...
متن کاملSequent and Hypersequent Calculi for Abelian and Lukasiewicz Logics
We present two embeddings of in nite-valued Lukasiewicz logic L into Meyer and Slaney’s abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding systems for L. These include: hypersequent calculi for A and L and terminating versions of these calculi; labelled single sequent calculi for A and L of comple...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملFull Abstraction in a Subtyped pi-Calculus with Linear Types
We introduce a concise pi-calculus with directed choices and develop a theory of subtyping. Built on a simple behavioural intuition, the calculus offers exact semantic analysis of the extant notions of subtyping in functional programming languages and session-based programming languages. After illustrating the idea of subtyping through examples, we show type-directed embeddings of two known sub...
متن کاملOn Embeddings of Homogeneous Spaces with Small Boundary
We study equivariant embeddings with small boundary of a given homogeneous space G/H, where G is a connected linear algebraic group with trivial Picard group and only trivial characters, and H ⊂ G is an extension of a connected Grosshans subgroup by a torus. Under certain maximality conditions, like completeness, we obtain finiteness of the number of isomorphism classes of such embeddings, and ...
متن کاملDatabase Query Languages Embedded in the Typed Lambda Calculus
We investigate the expressive power of the typed-calculus when expressing computations over nite structures, i.e., databases. We show that the simply typed-calculus can express various database query languages such as the relational algebra, xpoint logic, and the complex object algebra. In our embeddings, inputs and outputs are-terms encoding databases, and a program expressing a query is a-ter...
متن کامل